A Weighted-Tree Similarity Algorithm for Multi-Agent Systems in E-Business Environments

نویسندگان

  • Virendrakumar C. Bhavsar
  • Harold Boley
  • Lu Yang
چکیده

A tree similarity algorithm for match-making of agents in e-business environments is presented. Product/service descriptions of seller and buyer agents are represented as nodelabelled, arc-labelled, arc-weighted trees. A similarity algorithm for such trees is developed as the basis for semantic match-making in a virtual marketplace. The trees are exchanged using a serialization in Object-Oriented RuleML. A corresponding Relfun representation is employed to implement the similarity algorithm as a parameterised, recursive functional-logic program. Results from our experiments are found to be meaningful for e-business/e-learning environments. The algorithm can also be applied in other environments wherein weighted trees are used. Keywords/phrases: multi-agent system, e-business, e-learning, similarity measure, arclabelled trees, arc-weighted trees, Object-Oriented RuleML, Relfun.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized weighted tree similarity algorithms for taxonomy trees

Taxonomy trees are used in machine learning, information retrieval, bioinformatics, and multi-agent systems for matching as well as matchmaking in e-business, e-marketplaces, and e-learning. A weighted tree similarity algorithm has been developed earlier which combines matching and missing values between two taxonomy trees. It is shown in this paper that this algorithm has some limitations when...

متن کامل

Voltage Coordination of FACTS Devices in Power Systems Using RL-Based Multi-Agent Systems

This paper describes how multi-agent system technology can be used as the underpinning platform for voltage control in power systems. In this study, some FACTS (flexible AC transmission systems) devices are properly designed to coordinate their decisions and actions in order to provide a coordinated secondary voltage control mechanism based on multi-agent theory. Each device here is modeled as ...

متن کامل

Similarity of Weighted Directed Acyclic Graphs

This thesis proposes a weighted DAG (wDAG) similarity algorithm for match-making in e-Business environments. We focus on the metadata representation of buyer and seller agents, as well as a similarity and associated simplicity measure over this information. In order to make the interaction between agents more meaningful and fine-grained, we choose node-labeled, arc-labeled and arc-weighted dire...

متن کامل

A Weighted-Tree Simplicity Algorithm for Similarity Matching of Partial Product

Our weighted-tree similarity algorithm matches buyers and sellers in e-Business environments. We use arc-labeled, arc-weighted trees to represent the products (or services) sought/offered by buyers/sellers. Partial product descriptions can be represented via subtrees missing in either or both of the trees. In order to take into account the effect of a missing subtree on the similarity between t...

متن کامل

A Weighted-Tree Simplicity Algorithm for Similarity Matching of Partial Product Descriptions

Our weighted-tree similarity algorithm matches buyers and sellers in e-Business environments. We use arc-labeled, arc-weighted trees to represent the products (or services) sought/offered by buyers/sellers. Partial product descriptions can be represented via subtrees missing in either or both of the trees. In order to take into account the effect of a missing subtree on the similarity between t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computational Intelligence

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2004